Algorithms for variable length Markov chain modeling
نویسندگان
چکیده
منابع مشابه
Algorithms for variable length Markov chain modeling
UNLABELLED We present a general purpose implementation of variable length Markov models. Contrary to fixed order Markov models, these models are not restricted to a predefined uniform depth. Rather, by examining the training data, a model is constructed that fits higher order Markov dependencies where such contexts exist, while using lower order Markov dependencies elsewhere. As both theoretica...
متن کاملAlgorithms for Variable Length
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A preex s i that contains the address of the subnetwork to which the machine belongs, and a suux (of length L ? js i j) containing the address of that particular machine within its subnetwork. In xed-length subnetwork addressing, js i j is independent of i, whereas in variable-length subn...
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولVariable Length Markov Chains
We study estimation in the class of stationary variable length Markov Ž . chains VLMC on a finite space. The processes in this class are still Markovian of high order, but with memory of variable length yielding a much bigger and structurally richer class of models than ordinary highorder Markov chains. From an algorithmic view, the VLMC model class has attracted interest in information theory ...
متن کاملMarkov Chain Models for GP and Variable-length GAs with Homologous Crossover
In this paper we present a Markov chain model for GP and variable-length GAs with homologous crossover: a set of GP operators where the offspring are created preserving the position of the genetic material taken from the parents. We obtain this result by using the core of Vose’s model for GAs in conjunction with a specialisation of recent GP schema theory for such operators. The model is then s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2004
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btg489